-
1 enumerable set
перечислимое множество; счетное множество -
2 enumerable set
-
3 enumerable set
English-Russian dictionary of Information technology > enumerable set
-
4 enumerable set
The English-Russian dictionary general scientific > enumerable set
-
5 enumerable set
Большой англо-русский и русско-английский словарь > enumerable set
-
6 enumerable set
1) перечислимое множество
2) счетное множество -
7 enumerable set
1) Математика: счётное множество2) Вычислительная техника: перечислимое множество -
8 enumerable set
-
9 enumerable set
перечислимое множество; счётное множествоEnglish-Russian dictionary of computer science and programming > enumerable set
-
10 enumerable set
-
11 enumerable set
Англо-русский словарь компьютерных и интернет терминов > enumerable set
-
12 enumerable set
English-Russian dictionary of terms that are used in computer games > enumerable set
-
13 enumerable set
перечислимое множество; счетное множествоEnglish-Russian dictionary of technical terms > enumerable set
-
14 enumerable set
-
15 recursively enumerable set
рекурсивно перечислимое множество
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > recursively enumerable set
-
16 non-enumerable set
The English-Russian dictionary general scientific > non-enumerable set
-
17 recursively enumerable set
failure set — множество отказов; множество неудачных исходов
The English-Russian dictionary general scientific > recursively enumerable set
-
18 non-enumerable set
Большой англо-русский и русско-английский словарь > non-enumerable set
-
19 recursively enumerable set
Большой англо-русский и русско-английский словарь > recursively enumerable set
-
20 non-enumerable set
См. также в других словарях:
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… … Wikipedia
Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects … Wikipedia
enumerable — [ɪ nju:m(ə)rəb(ə)l] adjective Mathematics able to be counted by one to one correspondence with the set of positive integers … English new terms dictionary
Diophantine set — In mathematics, a Diophantine equation is an equation of the form P(x1, ..., xj, y1, ..., yk)=0 (usually abbreviated P(x,y)=0 ) where P(x,y) is a polynomial with integer coefficients. A Diophantine set is a subset S of Nj [1] so that for some… … Wikipedia
Simple set — In recursion theory a simple set is an example of a set which is recursively enumerable but not recursive. Definition A subset S of the natural numbers N is called simple if it satisfies the following properties # N S is infinite and contains no… … Wikipedia
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Countable set — Countable redirects here. For the linguistic concept, see Count noun. Not to be confused with (recursively) enumerable sets. In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of… … Wikipedia
co-recursively enumerable — adjective Describing a set for which there exists a deterministic algorithm that will list all items not in that set. Any recursively enumerable set which is also co recursively enumerable is a decidable set … Wiktionary
Empty set — ∅ redirects here. For similar looking symbols, see Ø (disambiguation). The empty set is the set containing no elements. In mathematics, and more specifically set theory, the empty set is the unique set having no elements; its size or cardinality… … Wikipedia
Class (set theory) — In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) which can be unambiguously defined by a property that all its members share. The precise definition of class… … Wikipedia